Sublinear-Time Algorithms for Tournament Graphs
نویسندگان
چکیده
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O (√ n · log n · √ log∗ n ) , that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic algorithm for solving a large class of search problems called Local Search, LS. LS is defined by us as a generalisation of the well-known class PLS.
منابع مشابه
STCON in Directed Unique-Path Graphs
We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON problem is to decide if there exists a path from s to t in G. For general graphs, the best polynomial-time algorithm for STCON uses space that is only slightly sublinear. However, for special classes of directed graphs, polynomi...
متن کاملSimple Examples of Sublinear-time Algorithms for Graphs 1.1 Definitions
For sublinear-time algorithms, it is crucial how input is represented and accessed. Depending on input representation and queries allowed, we might or might not be able to solve a given problem in sublinear time. In addition, in the property testing model, the correctness guarantee of the algorithm depends on the distance between objects, which is typically normalized by the size of the input. ...
متن کاملSublinear graph augmentation for fast query implementation
We introduce the problem of augmenting graphs with sublinear memory in order to speed up replies to queries. As a concrete example, we focus on the following problem: the input is an (unpartitioned) bipartite graph G = (V,E). Given a query v ∈ V , the algorithm’s goal is to output v’s color in some legal 2-coloring of G, using few probes to the graph. All replies have to be consistent with the ...
متن کاملWhat Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? —Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples—
This paper analyzes what structural features of graph problems allow efficient parallel algorithms. We survey some parallel algorithms for typical problems on three kinds of graphs, outerplanar graphs, trapezoid graphs and in-tournament graphs. Our results on the shortest path problem, the longest path problem and the maximum flow problem on outerplanar graphs, the minimum-weight connected domi...
متن کاملLinear-time certifying algorithms for recognizing split graphs and related graph classes∗
We give the first linear-time certifying algorithms to recognize split graphs, threshold graphs, bipartite chain graphs, cobipartite chain graphs and trivially perfect graphs, with sublinear certificates for negative output. In case of membership in a given graph class our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membersh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009